منابع مشابه
Cover semantics for quantified lax logic
Lax modalities occur in intuitionistic logics concerned with hardware verification, the computational lambda calculus, and access control in secure systems. They also encapsulate the logic of Lawvere-Tierney-Grothendieck topologies on topoi. This paper provides a complete semantics for quantified lax logic by combining the Beth-Kripke-Joyal cover semantics for first-order intuitionistic logic w...
متن کاملCounterpart Semantics for Quantified Modal Logic
In this paper we deal with the semantics for quantified modal logic, QML in short, and their philosophical relevance. In the first part we introduce Kripke semantics for the first-order modal language L= with identity, then we consider some unsatisfactory features of this account from an actualist point of view. In addition, we show that the calculus QE .K + BF on free logic, with the Barcan fo...
متن کاملAn alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variableassignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is...
متن کاملA General Semantics for Quantified Modal Logic
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complete semantics to the quantified extensions, both with and without the Barcan formula, of every propositional modal logic S. If S is canonical our models are based on propositional frames that validate S. We employ frame...
متن کاملHierarchies in Inclusion Logic with Lax Semantics
We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2010
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exq029